Improved Smoothed Analysis of Multiobjective Optimization
نویسندگان
چکیده
منابع مشابه
An Improved Clonal Algorithm in Multiobjective Optimization
In this paper, we develop a novel clonal algorithm for multiobjective optimization (NCMO) which is improved from three approaches, i.e., dynamic mutation probability, dynamic simulated binary crossover (D-SBX) operator and hybrid mutation operator combining with Gaussian and polynomial mutations (GP-HM operator). Among them, the GP-HM operator is controlled by the dynamic mutation probability. ...
متن کاملAnalysis and Applications of Evolutionary Multiobjective Optimization Algorithms Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms
This thesis deals with the analysis and application of evolutionary algorithms for optimization problems with multiple objectives. Many application problems involve (i) a system model that is not given in closed analytical form and (ii) multiple, often conflicting optimization criteria. Both traits hamper the appli¬ cation of classical optimization techniques, which require a certain structure ...
متن کاملAn Improved Multiobjective Particle Swarm Optimization Based on Culture Algorithms
In this paper, we propose a new approach to raise the performance of multiobjective particle swam optimization. The personal guide and global guide are updated using three kinds of knowledge extracted from the population based on cultural algorithms. An epsilon domination criterion has been employed to enhance the convergence and diversity of the approximate Pareto front. Moreover, a simple pol...
متن کاملAn improved robust topology optimization approach using multiobjective evolutionary algorithms
Robust topology optimization has gained importance during the last years. This paper presents a robust approach to topology optimization using multiobjective evolutionary algorithms. A key contribution of our approach is that our optimization model handles structural robustness through the first two objectives, namely, the expected compliance and its variance; whereas a third objective incorpor...
متن کاملImproved smoothed analysis of the k-means method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving a gap between practical and theoretical performance. Arthur and Vassilvitskii [3] aimed at closing this gap, and they proved a bound of poly(nk, σ−1) on the smoothed running-time of the k-means method, where n is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2015
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2699445